Eeective Paging Schemes with Delay Bounds as Qos Constraints in Wireless Systems

as QoS Constraints in Wireless Systems Wenye Wang, Ian F. Akyildiz, and Gordon L. St uber School of Electrical and Computer Engineering Georgia Institute of Technology Atlanta, GA 30332 Email: fwenye, ian, [email protected] Tel: (404)-894-5141; Fax: (404) 894-7883 Abstract In this paper, new paging schemes are introduced to reduce paging costs under delay bounds. In general, location tracking schemes require intensive computation to search for a mobile terminal in current wireless systems. Three new paging schemes, reverse, semi-reverse and uniform, provide a simple way of partitioning the service areas and accordingly minimize the paging costs based on each mobile terminal's location probability distribution. Numerical results demonstrate signi cant reduction in paging costs for various probability distributions, such as uniform, truncated discrete Gaussian, and irregular distributions.